Strong subadditivity lower bound and quantum channels
نویسندگان
چکیده
We derive the strong subadditivity of von Neumann entropy with a strict lower bound, dependent on distribution quantum correlation in system. investigate structure states saturating bounded and examine its consequences for data processing inequality. The achieves bound associated locally inaccessible information.
منابع مشابه
entropy , area , and strong subadditivity
The trace over the degrees of freedom located in a subset of the space transforms the vacuum state into a mixed density matrix with non zero entropy. This geometric entropy is believed to be deeply related to the entropy of black holes. Indeed, previous calculations in the context of quantum field theory, where the result is actually ultraviolet divergent, have shown that the geometric entropy ...
متن کاملQuantum lower bound for sorting ∗
Needless to say, sorting, especially sorting by comparisons, has been a classical problem in computer science. Despite its enormous importance, the complexity, in terms of the number of comparisons needed, is simple to analyze. Straightforward information theoretical argument gives the tight lower bound of log2(n!), which is achieved by several simple sorting algorithms, for example, Insertion ...
متن کاملGeometric Entropy, Area, and Strong Subadditivity
The trace over the degrees of freedom located in a subset of the space transforms the vacuum state into a mixed density matrix with non zero entropy. This geometric entropy is believed to be deeply related to the entropy of black holes. Indeed, previous calculations in the context of quantum field theory, where the result is actually ultraviolet divergent, have shown that the geometric entropy ...
متن کاملQuantum Formulas: A Lower Bound and Simulation
We show that Nechiporuk’s method [26] for proving lower bounds for Boolean formulas can be extended to the quantum case. This leads to an Ω(n/ log n) lower bound for quantum formulas computing an explicit function. The only known previous explicit lower bound for quantum formulas [27] states that the majority function does not have a linear–size quantum formula. We also show that quantum formul...
متن کاملA Minkowski Type Trace Inequality and Strong Subadditivity of Quantum Entropy Ii: Convexity and Concavity
We revisit and prove some convexity inequalities for trace functions conjectured in the earlier part I. The main functional considered is Φp,q(A1, A2, . . . , Am) = (
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information Processing
سال: 2022
ISSN: ['1573-1332', '1570-0755']
DOI: https://doi.org/10.1007/s11128-022-03419-7